package 数据结构OJ;

/**
 * @author shy_black
 * @date 2019/6/26 10:16
 * @Description:
 * // Parameters:
 *     //    numbers:     an array of integers
 *     //    length:      the length of array numbers
 *     //    duplication: (Output) the duplicated number in the array number,
 *     //length of duplication array is 1,so using duplication[0] = ? in implementation;
 *     //  Here duplication like pointor in C/C++, duplication[0] equal *duplication in C/C++
 *     //    这里要特别注意~返回任意重复的一个，赋值duplication[0]
 *     // Return value:       true if the input is valid, and there are some duplications in the array number
 *     //                     otherwise false
 */
public class 数组中重复的数字 {

    public boolean duplicate(int numbers[],int length,int [] duplication) {
        boolean[] tmp = new boolean[length];
        for(int i = 0;i < length;i++) {
            if(tmp[numbers[i]] == true) {
                duplication[0] = numbers[i];
                return true;
            }
            tmp[numbers[i]] = true;
        }
        return false;
    }
}
